Fast Calculation of the Empty Volume in Molecular Systems by the Use of Voronoi-Delaunay Subsimplexes
نویسندگان
چکیده
The calculation of the occupied and empty volume in an ensemble of overlapping spheres is not a simple task in general. There are different analytical and numerical methods, which have been developed for the treatment of specific problems, for example the calculation of local intermolecular voids or ‒ vice versa ‒ of the volume of overlapping atoms. A very efficient approach to solve these problems is based on the Voronoi-Delaunay subsimplexes, which are special triangular pyramids defined at the intersection of a Voronoi polyhedron and Delaunay simplex. The subsimplexes were proposed in a paper [1] (Sastry S.et al., Phys. Rev. E, vol.56, 5524–5532, 1997) for the calculation of the cavity volume in simple liquids. Later, the subsimplexes were applied for the treatment of the union of strongly overlapping spheres [2] (Voloshin V.P. et al., Proc. of the 8th ISVD, 170–176, 2011). In this article we discuss wider applications of subsimplexes for the calculation of the occupied and empty volumes of different structural units, selected in molecular systems. In particular, we apply them to Voronoi and Delaunay shells, defined around a solute, as well as their intersection. It opens a way to calculate the components of the partial molar volume of a macromolecule in solution, what is important for the interpretation of experimental volumetric data for protein solutions. The method is illustrated by the application to molecular dynamics models of a hIAPP polypeptide molecule in water at different temperatures.
منابع مشابه
Voronoi-Delaunay analysis of voids in systems of nonspherical particles.
The Voronoi network is known to be a useful tool for the structural description of voids in the packings of spheres produced by computer simulations. In this article we extend the Voronoi-Delaunay analysis to packings of nonspherical convex objects. Main properties of the Voronoi network, which are known for systems of spheres, are valid for systems of any convex objects. A general numerical al...
متن کاملMobile Robot Online Motion Planning Using Generalized Voronoi Graphs
In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...
متن کاملCalculation of the volumetric characteristics of biomacromolecules in solution by the Voronoi-Delaunay technique.
Recently a simple formalism was proposed for a quantitative analysis of interatomic voids inside a solute molecule and in the surrounding solvent. It is based on the Voronoi-Delaunay tessellation of structures, obtained in molecular simulations: successive Voronoi shells are constructed, starting from the interface between the solute molecule and the solvent, and continuing to the outside (into...
متن کاملAn obstruction to Delaunay triangulations in Riemannian manifolds
Delaunay has shown that the Delaunay complex of a finite set of points P of Euclidean space R triangulates the convex hull of P , provided that P satisfies a mild genericity property. Voronoi diagrams and Delaunay complexes can be defined for arbitrary Riemannian manifolds. However, Delaunay’s genericity assumption no longer guarantees that the Delaunay complex will yield a triangulation; stron...
متن کاملFast System Matrix Calculation in CT Iterative Reconstruction
Introduction: Iterative reconstruction techniques provide better image quality and have the potential for reconstructions with lower imaging dose than classical methods in computed tomography (CT). However, the computational speed is major concern for these iterative techniques. The system matrix calculation during the forward- and back projection is one of the most time- cons...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Trans. Computational Science
دوره 22 شماره
صفحات -
تاریخ انتشار 2014